#include <stdio.h>

#define LEN 10

int a[LEN]	= {1,3,2,9,4,7,6,0,8,5};

int
partition(int start, int end) {
	int mid;
	mid		= (start + end) / 2;
	for() {

	}
	return mid;
}

void quickSort(int start, int end) {
	int mid;
	if(end > start) {
		mid		= partition(start, end);
		quickSort(start, mid);
		quickSort(mid + 1, end);
	}
}

int
main(int * argc, char * argv[]) {
	quickSort();

	return 0;
}